Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request
Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Quantum speedup for graph sparsification, cut approximation, and Laplacian solving

Subjects: FOS: Computer and information sciences; Speedup; General Computer Science

  • Source: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science: FOCS 2020 : proceedings : 16-19 November 2020, virtual conference, 637-648STARTPAGE=637;ENDPAGE=648;TITLE=2020 IEEE 61st

تفاصيل العنوان

×

Consensus-Halving: Does It Ever Get Easier?

Subjects: FOS: Computer and information sciences; General Computer Science; Computer science

  • Source: Filos-Ratsikas, A, Hollender, A, Sotiraki, K & Zampetakis, M 2023, ' Consensus-Halving: Does It Ever Get Easier? ', SIAM Journal on Computing, vol. 52, no. 2, pp. 563-602 .

تفاصيل العنوان

×
  • 1-10 of  14,970 نتائج ل ""Graph Theory""